Probability propagation and decoding in analog VLSI
نویسندگان
چکیده
منابع مشابه
Probability propagation and decoding in analog VLSI
The sum-product algorithm (belief/probability propagation) can be naturally mapped into analog transistor circuits. These circuits enable the construction of analog-VLSI decoders for turbo codes, low-density parity-check codes, and similar codes.
متن کاملProbability Propagation in Analog VLSI
The sum-product algorithm (probability propagation) can be mapped directly into analog transistor circuits. These circuits enable the construction of analog-VLSI decoders for turbo codes, low-density parity-check codes, and similar codes. Patent application pending. This research was supported by the Swiss National Science Foundation under Grant 21-49619.96. Endora Tech AG, Gartenstrasse 120, C...
متن کاملMargin Propagation and Forward Decoding in Analog Vlsi
We propose margin propagation as an alternative to probability propagation in forward decoding. In contrast to sumproduct probability propagation, margin propagation only incurs addition and subtraction in the computation and thus leads to reduced complexity of implementation. Simulations indicate that margin based forward decoding is more robust to input noise and parameter mismatch than sumpr...
متن کاملAn analog VLSI decoding technique for digital codes
The design of various high-speed interface architectures for off-chip connections to and from analog, iterative VLSI decoders is discussed. It is shown that for applications with high transmission rates and low to medium accuracy, MOSFET-only R-2R ladders in combination with switched-current memory cells are ideally suited, due to their current mode nature as well as their power and area effici...
متن کاملAnalog Decoding and Beyond
In 1998, Hagenauer [6, 7] and Loeliger et al. [9] independently proposed to decode error correcting codes by analog electronic networks. In contrast to previous work on analog Viterbi decoders (e.g. Shakiba et al. [15] and several others before, see [10]), the work both by Hagenauer and by Loeliger et al. was inspired by “turbo”-style decoding of codes described by graphs [5, 16, 17]. Large gai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2001
ISSN: 0018-9448
DOI: 10.1109/18.910594